A Finite Covering Tree for Analysing Entropic Broadcast Protocols (Abstract)
نویسندگان
چکیده
For general broadcast protocols, the natural generalization of the Karp and Miller procedure does not terminate; even the problem of deciding if a broadcast protocol may exhibit an infinite behavior is undecidable [4]. We define a subclass of broadcast protocols, called entropic broadcast protocols, which "contains" the MESI protocol, and we prove that the Generalized Karp and Miller procedure terminates and it gives a finite covering tree. We also prove that liveness is undecidable.
منابع مشابه
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
Lazy abstraction builds up an abstract reachability tree by locally refining abstractions in order to eliminate spurious counterexamples in smaller and smaller subtrees. The method has proven useful to verify systems code. It is still open how good the method is as a decision procedure, i.e., whether the method terminates for already known decidable verification problems. In this paper, we answ...
متن کاملSurvey of Topology-based Multicast Routing Protocols for Mobile Ad hoc Networks
This review paper presents an exhaustive survey on the different categories of topology-based multicast routing protocols that have been proposed for mobile ad hoc networks (MANETs). Due to the inherent broadcast nature of the wireless medium, oneto-many multicast communications are characteristic of most of the MANET applications. MANET multicast routing protocols are primarily classified as t...
متن کاملEnhancing the expressivity and automation of an interactive theorem prover in order to verify multicast protocols
This thesis was motivated by a case study involving the formalisation of arguments that simplify the verification of tree-oriented multicast protocols. As well as covering the case study itself, it discusses our solution to problems we encountered concerning expressivity and automation. The expressivity problems related to the need for theory interpretation. We found the existing Locale and axi...
متن کاملEpistemic Verification of Anonymity
Model checking techniques for communication protocols usually are phrased in terms of processes, basically labelled arcs in a labelled transition system. We propose to lift checking for such protocols to a more abstract level by analysing the protocols as composite communicative actions, with a communicative action viewed as a mapping on an appropriate class of epistemic models. As an example, ...
متن کاملStatic analysis of topology-dependent broadcast networks
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast networks have focused on fixed connectivities, but this is unsuitable in the case of wireless networks where the dynamically changing network topology is a crucial ingredient. In this paper we develop a static analysis that ...
متن کامل